Quantum Finite Multitape Automata
نویسندگان
چکیده
Quantum finite automata were introduced by C. Moore, J. P. Crutchfield [MC 97], and by A. Kondacs and J. Watrous [KW 97]. This notion is not a generalization of the deterministic finite automata. Moreover, in [KW 97] it was proved that not all regular languages can be recognized by quantum finite automata. A. Ambainis and R. Freivalds [AF 98] proved that for some languages quantum finite automata may be exponentially more concise rather than both deterministic and probabilistic finite automata. In this paper we introduce the notion of quantum finite multitape automata and prove that there is a language recognized by a quantum finite automaton but not by deterministic or probabilistic finite automata. This is the first result on a problem which can be solved by a quantum computer but not by a deterministic or probabilistic computer. Additionally we discover unexpected probabilistic automata recognizing complicated languages.
منابع مشابه
The Equivalence Problem of Multitape Finite Automata
Using a result of B.H. Neumann we extend Eilenberg’s Equality Theorem to a general result which implies that the multiplicity equivalence problem of two (nondeterministic) multitape finite automata is decidable. As a corollary we solve a long standing open problem in automata theory, namely, the equivalence problem for multitape deterministic finite automata. The main theorem states that there ...
متن کاملOn Minimality and Size Reduction of One-Tape and Multitape Finite Automata
In this thesis, we consider minimality and size reduction issues of one-tape and multitape automata. Although the topic of minimization of one-tape automata has been widely studied for many years, it seems that some issues have not gained attention. One of these issues concerns finding specific conditions on automata that imply their minimality in the class of nondeterministic finite automata (...
متن کاملRevisiting the Equivalence Problem for Finite Multitape Automata
The decidability of determining equivalence of deterministic multitape automata (or transducers) was a longstanding open problem until it was resolved by Harju and Karhumäki in the early 1990s. Their proof of decidability yields a co-NP upper bound, but apparently not much more is known about the complexity of the problem. In this paper we give an alternative proof of decidability, which follow...
متن کاملThe “equal last” predicate for words on infinite alphabets and classes of multitape automata
Along with the usual predicates “prefix” and “equal length”, the predicate “equal last letter” leads to a first order theory of the free infinitely generated monoid whose definable relations are related to the algebra of relations recognized by different types of multitape automata which are natural extensions of the famous Rabin-Scott multitape automata and the so-called synchronous automata. ...
متن کاملThe Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
Complexity in Convex Languages p. 1 Three Learnable Models for the Description of Language p. 16 Arbology: Trees and Pushdown Automata p. 32 Analysis of Communicating Automata p. 50 Regular Papers Complexity of the Satisfiability Problem for a Class of Propositional Schemata p. 58 A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton p. 70 A Fast Longest Common Subsequence A...
متن کامل